The pseudo core inverse of a companion matrix

A factorization of the inverse of the shifted companion matrix

Ela a Factorization of the Inverse of the Shifted Companion Matrix

A common method for computing the zeros of an n-th degree polynomial is to compute the eigenvalues of its companion matrix C. A method for factoring the shifted companion matrix C − ρI is presented. The factorization is a product of 2n − 1 essentially 2 × 2 matrices and requires O(n) storage. Once the factorization is computed it immediately yields factorizations of both (C − ρI) and (C − ρI). ...

determinant of the hankel matrix with binomial entries

abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.

Using Pseudo-Inverse to Eliminate the Limitation of the Number of Colors in Colorimetric Match

An algorithm is suggested for implementation of unlimited primaries in two-constants Kubelka-Munk color matching attempt. Allen's method for tristimulus color matching which was limited to four colorants in two constant theory, dealt with inversable matrices. By application of the pseudo-inverse, it is not necessary to limit the number of primary colors to four as Allen suggested. The suggested...

Generalized inverse of fuzzy neutrosophic soft matrix

Neutrosophy is a new branch of philosophy that studies the origin, nature, and scope of neutralities, as well as their interactions with different ideational spectra. Aim of this article is to find the maximum and minimum solution of the fuzzy neutrosophic soft relational equations xA=b and Ax=b, where x and b are fuzzy neutrosophic soft vector and A is a fuzzy neutrosophic soft matrix. Wheneve...